Termination of the following Term Rewriting System could be disproven:

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

and(tt) → X
__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
isListisNeList
isListtt
isListand(isList)
isNeListisQid
isNeListand(isList)
isNeListand(isNeList)
isNePalisQid
isNePaland(isQid)
isPalisNePal
isPaltt
isQidtt



GTRS
  ↳ CritRuleProof

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

and(tt) → X
__(__(X, Y), Z) → __(X, __(Y, Z))
__(X, nil) → X
__(nil, X) → X
isListisNeList
isListtt
isListand(isList)
isNeListisQid
isNeListand(isList)
isNeListand(isNeList)
isNePalisQid
isNePaland(isQid)
isPalisNePal
isPaltt
isQidtt


The rule and(tt) → X contains free variables in its right-hand side. Hence the TRS is not-terminating.